A Complementarity Active-Set Algorithm for Mathematical Programming Problems with Equilibrium Constraints
نویسندگان
چکیده
In this paper, an algorithm for solving a Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints (MPEC) is introduced, which uses the active-set methodology while maintaining the complementarity restrictions throughout the procedure. Finite convergence of the algorithm to a stationary point of the MPEC is established under reasonable hypotheses. The algorithm can be easily implemented by adopting any active-set code for nonlinear programming. Computational experience is included to highlight the efficacy of the proposed method in practice.
منابع مشابه
A Complementarity-based Partitioning and Disjunctive Cut Algorithm for Mathematical Programming Problems with Equilibrium Constraints
In this paper a branch-and-bound algorithm is proposed for finding a global minimum to a Mathematical Programming Problem with Complementarity (or Equilibrium) Constraints (MPECs), which incorporates disjunctive cuts for computing lower bounds and employs a Complementarity Active-Set Algorithm for computing upper bounds. Computational results for solving MPECs associated with Bilivel Problems, ...
متن کاملA Class of Mathematical Programs with Equilibrium Constraints: A Smooth Algorithm and Applications to Contact Problems
We discuss a special mathematical programming problem with equilibrium constraints (MPEC), that arises in material and shape optimization problems involving the contact of a rod or a plate with a rigid obstacle. This MPEC can be reduced to a nonlinear programming problem with independent variables and some dependent variables implicity defined by the solution of a mixed linear complementarity p...
متن کاملOn Vector Equilibrium Problem with Generalized Pseudomonotonicity
In this paper, first a short history of the notion of equilibrium problem in Economics and Nash$acute{'}$ game theory is stated. Also the relationship between equilibrium problem among important mathematical problems like optimization problem, nonlinear programming, variational inequality problem, fixed point problem and complementarity problem is given. The concept of generalized pseudomonoton...
متن کاملA Smoothing Penalty Method for Mathematical Programs with Equilibrium Constraints
In this thesis, a new smoothing penalty algorithm is introduced to solve a mathematical program with equilibrium constraints (MPEC). By smoothing the exact penalty function, an MPEC is reformulated as a series of subprograms which belong to a class of MPECs with simple linear complementarity constraints. To deal with the subproblems, a hybrid algorithm is proposed, which combines the active set...
متن کاملThe linear complementarity problem: Methods and applications
This report gives an overview of the linear complementarity problem, as a special case of mathematical programming with equilibrium constraints. The interior point method and two versions of Lemke’s method are reviewed, as methods for solving the linear complementarity problem. The report concludes with a description of the Stackelberg game and the bimatrix game as possible applications of math...
متن کامل